A new shortest path routing algorithm and embedding cycles of crossed cube
نویسندگان
چکیده
A n n-dzmensaonal crossed cube, CQn, zs a varzataon of hypercubes. In thzs paper, we gave a new shortest path routzng algorzthm based on a new dastance measure defined herean. In comparzson wath Efe's algorzthm whzch generates one shortest path an O(n2) tame, our algorathm can generate more shortest paths zn O(n) tame. Furthermore, we show that CQn zs a pancyclzc network and we construct varaous types of cycles of an arbztrary length at least four
منابع مشابه
Edge Congestion and Topological Properties of Crossed Cubes
An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path routing algorithm, we consider a new perfo...
متن کاملA Fault-tolerant Optimal Message Routing Methodology for Cube-connected-cycles Parallel Computers
A cube-connected-cycles (CCC) is a regular graph, suitable for constructing the interconnection network of parallel or multi-node computer systems. The CCC network possesses the features of symmetry, regularity, fault tolerance, and fixed degree of the network. Message delivery through an interconnection network sometimes fails due to processing node and/or link faults or simply because some pr...
متن کاملOptimal Routing in the Cube-Connected Cycles Interconnection Network
An optimal message routing algorithm for thc cube-connected cycles processor interconnection network is described, and the average:message path length is derived assuming a uniform message routing distribution. The optimal algorithm is comparetl to one preViously proposed and is shown to have significanlly shorter average path length.
متن کاملThe nearly shortest path embedding in Crossed Cubes
A graph G is panconnected if each pair of distinct vertices u, v ∈ V (G) are joined by a path of length l with dG(u, v) ≤ l ≤ |V (G)| − 1, where dG(u, v) is the length of shortest path joining u and v in G. Fan et. al.[7] proved that n-dimension Crossed cube, CQn, is almost panconnected except the path of length dCQn(u, v) + 1 for any two distinct vertices u, v ∈ CQn recently. In this paper, We...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کامل